Predicting a stationary process when the correlation function is convex
نویسندگان
چکیده
منابع مشابه
When Is Multidimensional Screening a Convex
A principal wishes to transact business with a multidimensional distribution of agents whose preferences are known only in the aggregate. Assuming a twist (= generalized Spence-Mirrlees single-crossing) hypothesis, quasi-linear utilities, and that agents can choose only pure strategies, we identify a structural condition on the value b(x, y) of product type y to agent type x — and on the princi...
متن کاملThe direct extension of ADMM for three-block separable convex minimization models is convergent when one function is strongly convex
The alternating direction method of multipliers (ADMM) is a benchmark for solving a two-block linearly constrained convex minimization model whose objective function is the sum of two functions without coupled variables. Meanwhile, it is known that the convergence is not guaranteed if the ADMM is directly extended to a multiple-block convex minimization model whose objective function has more t...
متن کاملWhen is correlation coevolution?
Studying the correlation between traits of interacting species has long been a popular approach for identifying putative cases of coevolution. More recently, such approaches have been used as a means to evaluate support for the geographic mosaic theory of coevolution. Here we examine the utility of these approaches, using mathematical and computational models to predict the correlation that evo...
متن کاملThe Stationary - NonStationary Process and The Variable Roots Difference Equations
Stochastic, processes can be stationary or nonstationary. They depend on the magnitude of shocks. In other words, in an auto regressive model of order one, the estimated coefficient is not constant. Another finding of this paper is the relation between estimated coefficients and residuals. We also develop a catastrophe and chaos theory for change of roots from stationary to a nonstationary one ...
متن کاملA case when the union of polytopes is convex
We present a necessary and sufficient condition for the union of a finite number of convex polytopes in Rd to be convex. This generalises two theorems on convexity of the union of convex polytopes due to Bemporad et al. © 2004 Elsevier Inc. All rights reserved. AMS classification: Primary 52A20, 52A35; Secondary 52B11, 52B55
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1958
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1958.100284